搜索资源列表
pso2
- graph coloring algorithm2 in java with 4 color
pso3
- java code for graph coloring using pso
Graph_coloring
- This Code solve the graph coloring problem by genetic algorithm.
exprdlg
- 本源代码在工具栏中加入了组合框，并且采用了自绘功能来实现列表项以不同的着色来显示项来对应函数图的着色，在此源程序中，你可在组合框中输入函数表达式（当然也可以加入X自变量），按回车后就可在视图中显示你所输入的表达式图，并在组合框中以对应的着色加入表达式字符。-Source code added in the toolbar combo box, and uses a self-drawn list items to display different colored items correspon
test_sol-2.3
- solution test for graph coloring linux code
GCP
- 着色问题，是最著名的NP-完全问题之一。 给定一个无向图G＝（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。-Coloring problem, is the most famous NP-complete problems. Given an undirected graph G = (V, E), where V is the set of vertices, E is the se
spectrum-allocation-color-algorithm
- 频谱分配算法，采用图着色的比例公平分配算法-Spectrum allocation algorithm, using the ratio of equitable distribution graph coloring algorithm
PicColor
- 用回溯法解决图着色问题,用回溯法解决图着色问题-Use backtracking to solve graph coloring problem
register-allocation-algorithm
- 图着色方法图，适用于寄存器分配 采用的是经典退火算法 -Graph coloring register allocation classic annealing algorithm
coulor
- 用我们所写的C++程序去实现我们想要得到的图形的染色-With our C++ program written to achieve what we want the graph coloring
tuzhuode
- 利用模拟退火法解决图着色问题，画出相应的图形，效果较好-Using simulated annealing method to solve the graph coloring problem, draw the appropriate graphics, better
color
- 图着色问题一个简单的C++程序，适合新手使用学习。-A simple graph coloring problem C++ procedures, suitable for beginners to use to learn.
color-problem
- 一个关于图着色问题的在matlab下的一种解法，适合新手使用学习。-A graph coloring problem on a solution in matlab for novices to use to learn.
tabucol
- 关于图着色问题中禁忌搜索算法的讲解，适合新手使用和学习-Tabu search algorithm on the graph coloring problem explanations, suitable for beginners to use and learn
NodeColoringTabu
- 在matlab下的一种图着色的禁忌算法实现，适合新手使用和学习-In matlab under a taboo graph coloring algorithm, suitable for novices to use and learn
galgorithm
- 贪心算法解图的着色问题，以点的连接度作优先排序-Greedy algorithm for solving graph coloring problem, to the point of connectivity for prioritization
arrangement
- 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 -Suppose you want to arrange a number of activities in the hall more than enough, and want
Source
- graph coloring c++ console
pythonSolvingExaminationArrangements
- 利用python采用着色问题解决算法解决排考场安排问题-Use python algorithm to solve the problem of Examination arrangements using Graph Coloring Problem Methods
yiqun
- 蚁群优化算法最初用于解决TSP问题，经过多年的发展，已经陆续渗透到其他领域中，比如图着色问题、大规模集成电路设计、通讯网络中的路由问题以及负载平衡问题、车辆调度问题等。-Ant colony optimization algorithm for solving the TSP problem initially, after years of development, has been gradually penetrate into other areas, such as graph col